Five axioms for location functions on median graphs

نویسندگان

  • Fred R. McMorris
  • Henry Martyn Mulder
  • Beth Novick
  • Robert C. Powers
چکیده

In previous work, two axiomatic characterizations were given for the median function on median graphs: one involving the three simple and natural axioms anonymity, betweenness and consistency; the other involving faithfulness, consistency and 12 -Condorcet. To date, the independence of these axioms has not been a serious point of study. The aim of this paper is to provide the missing answers. The independent subsets of these five axioms are determined precisely and examples provided in each case on arbitrary median graphs. There are three cases that stand out. Here non-trivial examples and proofs are needed to give a full answer. Extensive use of the structure of median graphs is used throughout.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An axiomatization of the median procedure on the n-cube

Abstract The general problem in location theory deals with functions that find sites on a graph (discrete case) or network (continuous case) in such a way as to minimize some cost (or maximize some benefit) to a given set of clients represented by vertices on the graph or points on the network. The axiomatic approach seeks to uniquely distinguish, by using a list of intuitively pleasing axioms,...

متن کامل

Axiomatic Characterization of the Median and Antimedian Functions on Cocktail-Party Graphs and Complete Graphs

A median (antimedian) of a profile of vertices on a graph G is a vertex that minimizes (maximizes) the remoteness value, that is, the sum of the distances to the elements in the profile. The median (or antimedian) function has as output the set of medians (antimedians) of a profile. It is one of the basic models for the location of a desirable (or obnoxious) facility in a network. The median fu...

متن کامل

The p-median and p-center Problems on Bipartite Graphs

Let $G$ be a bipartite graph. In this paper we consider the two kind of location problems namely $p$-center and $p$-median problems on bipartite graphs. The $p$-center and $p$-median problems asks to find a subset of vertices of cardinality $p$, so that respectively the maximum and sum of the distances from this set to all other vertices in $G$ is minimized. For each case we present some proper...

متن کامل

A tight axiomatization of the median procedure on median graphs

Aprofileπ = (x1, . . . , xk), of length k, in a finite connected graphG is a sequence of vertices ofG, with repetitions allowed. Amedian x ofπ is a vertex forwhich the sumof the distances from x to the vertices in the profile is minimum. The median function finds the set of all medians of a profile. Medians are important in location theory and consensus theory. A median graph is a graph for whi...

متن کامل

On characterizations of weakly $e$-irresolute functions

The aim of this paper is to introduce and obtain some characterizations of weakly $e$-irresolute functions by means of $e$-open sets defined by Ekici [6]. Also, we look into further properties relationships between weak $e$-irresoluteness and separation axioms and completely $e$-closed graphs.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete Math., Alg. and Appl.

دوره 7  شماره 

صفحات  -

تاریخ انتشار 2015